Error-Free Message Transmission in the Universal Composability Framework

نویسندگان

  • David A. Wilson
  • Chris Peikert
  • Arthur C. Smith
چکیده

This thesis introduces models for error-prone communication channels and functionalities for error-free communication in the Universal Composability framework. Realizing these functionalities enables protocols to make use of cryptographic errorcorrecting schemes which are more powerful than classical codes. First, we define new ideal functionalities TrCLOSE and FCWT to model error-prone communication channels. Then, we define four different ideal functionalities for errorfree message transmission, each providing successively stronger message delivery guarantees. Using ideal message certification, we give protocols which realize three of these functionalities for error rates up to 1/2. Finally, we prove that the fourth functionality, which models error-free data storage, is not realizable if the error rate exceeds 1/4. Thesis Supervisor: Ronald L. Rivest Title: Andrew and Erna Viterbi Professor of Electrical Engineering and Computer Science Thesis Supervisor: Chris Peikert Title: Thesis Co-Supervisor

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Framework for Protocol Analysis

We describe a novel reformulation of Canetti’s Universal Composability (UC) framework for the analysis of cryptographic protocols. Our framework is different mainly in that it is (a) based on systems of interactive Turing machines with a fixed communication graph and (b) augmented with a global message queue that allows the sending of multiple messages per activation. The first feature signific...

متن کامل

Using Sphinx to Improve Onion Routing Circuit Construction (short paper)⋆

This paper presents compact message formats for onion routing circuit construction using the Sphinx methodology developed for mixes. We significantly compress the circuit construction messages for three onion routing protocols that have emerged as enhancements to the Tor anonymizing network; namely, Tor with predistributed DiffieHellman values, pairing-based onion routing, and certificateless o...

متن کامل

Composability and On-Line Deniability of Authentication

Protocols for deniable authentication achieve seemingly paradoxical guarantees: upon completion of the protocol the receiver is convinced that the sender authenticated the message, but neither party can convince anyone else that the other party took part in the protocol. We introduce and study on-line deniability, where deniability should hold even when one of the parties colludes with a third ...

متن کامل

Universally Composable Security Analysis of TLS

We present a security analysis of the complete TLS protocol in the Universal Composable security framework. This analysis evaluates the composition of key exchange functionalities realized by the TLS handshake with the message transmission of the TLS record layer to emulate secure communication sessions and is based on the adaption of the secure channel model from Canetti and Krawczyk to the se...

متن کامل

Using Sphinx to Improve Onion Routing Circuit Construction

This paper presents compact message formats for onion routing circuit construction using the Sphinx methodology developed for mixes. We significantly compress the circuit construction messages for three onion routing protocols that have emerged as enhancements to the Tor anonymizing network; namely, Tor with predistributed Diffie-Hellman values, pairing-based onion routing, and certificateless ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005